\contentsline {chapter}{\numberline {第1章}引言}{1}%
\contentsline {section}{\numberline {1.1}对等网络概述}{2}%
\contentsline {subsection}{\numberline {1.1.1}P2P简单发展历史回顾}{3}%
\contentsline {subsection}{\numberline {1.1.2}P2P研究的关键问题}{4}%
\contentsline {section}{\numberline {1.2}对等网络中的搜索技术}{5}%
\contentsline {subsection}{\numberline {1.2.1}P2P搜索算法的分类和当前进展情况}{5}%
\contentsline {subsection}{\numberline {1.2.2}研究P2P中高效率、功能多样化的搜索算法之必要性}{6}%
\contentsline {subsection}{\numberline {1.2.3}P2P中信息搜索的困难和挑战}{7}%
\contentsline {section}{\numberline {1.3}本文研究的主要内容和主要贡献}{8}%
\contentsline {subsection}{\numberline {1.3.1}研究什么和不研究什么}{8}%
\contentsline {subsection}{\numberline {1.3.2}各章内容简介}{10}%
\contentsline {subsection}{\numberline {1.3.3}本文的主要贡献}{12}%
\contentsline {chapter}{\numberline {第2章}相关工作}{13}%
\contentsline {section}{\numberline {2.1}对等网络基础设施}{13}%
\contentsline {subsection}{\numberline {2.1.1}非结构化P2P系统与非收敛性路由}{13}%
\contentsline {subsection}{\numberline {2.1.2}结构化P2P系统与收敛性路由}{14}%
\contentsline {subsection}{\numberline {2.1.3}P2P系统中的数据存放策略}{16}%
\contentsline {section}{\numberline {2.2}传统集中式环境中的信息搜索}{18}%
\contentsline {subsection}{\numberline {2.2.1}信息索引技术}{18}%
\contentsline {subsection}{\numberline {2.2.2}结果缓存技术}{20}%
\contentsline {subsection}{\numberline {2.2.3}相关性评估技术}{22}%
\contentsline {section}{\numberline {2.3}对等网络中的信息搜索}{23}%
\contentsline {subsection}{\numberline {2.3.1}宽松约束的搜索}{23}%
\contentsline {subsection}{\numberline {2.3.2}严格约束的搜索}{25}%
\contentsline {subsection}{\numberline {2.3.3}面向语义的信息搜索}{26}%
\contentsline {section}{\numberline {2.4}本章小结}{28}%
\contentsline {chapter}{\numberline {第3章}对等网络中宽松约束的一般性搜索的理论模型}{29}%
\contentsline {section}{\numberline {3.1}本章引论}{29}%
\contentsline {section}{\numberline {3.2}模型基本假设}{30}%
\contentsline {subsection}{\numberline {3.2.1}无偏向性搜索}{30}%
\contentsline {subsection}{\numberline {3.2.2}结点特性}{31}%
\contentsline {subsection}{\numberline {3.2.3}短时稳态性}{32}%
\contentsline {subsection}{\numberline {3.2.4}模型假设的总体叙述}{33}%
\contentsline {section}{\numberline {3.3}宽松约束的一般性搜索性能理论模型}{34}%
\contentsline {subsection}{\numberline {3.3.1}单次搜索的带宽开销以及系统总带宽开销}{34}%
\contentsline {subsection}{\numberline {3.3.2}索引分布与搜索开销的关系}{35}%
\contentsline {subsection}{\numberline {3.3.3}索引分布与索引维护开销的关系}{36}%
\contentsline {subsection}{\numberline {3.3.4}搜索总带宽开销和搜索效率的计算公式}{37}%
\contentsline {subsection}{\numberline {3.3.5}模型总体叙述}{38}%
\contentsline {section}{\numberline {3.4}模型求解及搜索性能优化}{38}%
\contentsline {subsection}{\numberline {3.4.1}最小化结点的带宽开销}{38}%
\contentsline {subsection}{\numberline {3.4.2}在带宽约束下最优化搜索效率}{39}%
\contentsline {subsection}{\numberline {3.4.3}模型中的参数测定}{40}%
\contentsline {section}{\numberline {3.5}模型结论和意义}{40}%
\contentsline {section}{\numberline {3.6}相关问题讨论}{42}%
\contentsline {subsection}{\numberline {3.6.1}模型的适用性}{42}%
\contentsline {subsection}{\numberline {3.6.2}与相关工作的比较}{43}%
\contentsline {section}{\numberline {3.7}本章小结}{44}%
\contentsline {chapter}{\numberline {第4章}近似最优性能的宽松约束搜索算法}{45}%
\contentsline {section}{\numberline {4.1}本章引论}{45}%
\contentsline {section}{\numberline {4.2}分级组管理（Hierarchical Group Management, HGM）}{46}%
\contentsline {subsection}{\numberline {4.2.1}HGM中的分级量化机制}{46}%
\contentsline {subsection}{\numberline {4.2.2}HGM的体系结构}{47}%
\contentsline {subsection}{\numberline {4.2.3}HGM中的逐级扩展搜索算法}{48}%
\contentsline {subsection}{\numberline {4.2.4}局域性原则（Principle of Locality）}{49}%
\contentsline {subsection}{\numberline {4.2.5}在结构化P2P上构建HGM的方法}{51}%
\contentsline {section}{\numberline {4.3}基于Pastry路由基础设施的分级组管理}{52}%
\contentsline {subsection}{\numberline {4.3.1}Pastry上的HGM结点分组结构}{52}%
\contentsline {subsection}{\numberline {4.3.2}基于Pastry路由的逐级扩展和组内局域性消息广播}{53}%
\contentsline {subsection}{\numberline {4.3.3}索引的维护与更新}{55}%
\contentsline {section}{\numberline {4.4}基于SkipNet路由基础设施的分级组管理}{58}%
\contentsline {subsection}{\numberline {4.4.1}SkipNet上的HGM结点分组结构}{58}%
\contentsline {subsection}{\numberline {4.4.2}基于SkipNet路由的逐级扩展和组内局域性消息广播}{62}%
\contentsline {subsection}{\numberline {4.4.3}索引的维护与更新}{66}%
\contentsline {section}{\numberline {4.5}相关问题讨论}{67}%
\contentsline {subsection}{\numberline {4.5.1}容错问题}{67}%
\contentsline {subsection}{\numberline {4.5.2}索引更新操作的时间}{68}%
\contentsline {section}{\numberline {4.6}本章小结}{68}%
\contentsline {chapter}{\numberline {第5章}对等网络中严格约束的区域搜索算法}{69}%
\contentsline {section}{\numberline {5.1}本章引论}{69}%
\contentsline {section}{\numberline {5.2}基于自然属性值匹配的数据存储以及区域搜索}{70}%
\contentsline {section}{\numberline {5.3}无中心的资源管理基础设施（DRMI）}{71}%
\contentsline {subsection}{\numberline {5.3.1}结点组的资源元数据信息}{71}%
\contentsline {subsection}{\numberline {5.3.2}资源元数据表（Resource Metadata Table，RMT）}{72}%
\contentsline {subsection}{\numberline {5.3.3}RMT的动态维护}{74}%
\contentsline {section}{\numberline {5.4}基于DRMI的资源管理与负载平衡算法}{75}%
\contentsline {subsection}{\numberline {5.4.1}监测任意结点组的资源信息}{75}%
\contentsline {subsection}{\numberline {5.4.2}DRMI上的渐次决策方法}{76}%
\contentsline {subsection}{\numberline {5.4.3}利用DRMI实现负载均衡的自然属性值匹配}{78}%
\contentsline {section}{\numberline {5.5}实验结果与分析}{79}%
\contentsline {subsection}{\numberline {5.5.1}资源信息监测的效率和正确性}{79}%
\contentsline {subsection}{\numberline {5.5.2}负载迁移算法}{80}%
\contentsline {section}{\numberline {5.6}相关工作}{81}%
\contentsline {section}{\numberline {5.7}本章小结}{82}%
\contentsline {chapter}{\numberline {第6章}结论}{83}%
\contentsline {section}{\numberline {6.1}研究总结}{83}%
\contentsline {section}{\numberline {6.2}需进一步开展的工作}{84}%
\contentsline {chapter}{参考文献}{87}%
\contentsline {chapter}{致\hspace {\ccwd }谢}{91}%
\contentsline {chapter}{声\hspace {\ccwd }明}{92}%
\setcounter {tocdepth}{0}
\contentsline {chapter}{\numberline {附录 A}资源元数据表}{93}%
\contentsline {chapter}{个人简历、在学期间发表的学术论文与研究成果}{99}%
\contentsfinish
